public class Solution598 {
    public int maxCount(int m, int n, int[][] ops) {
        int m1=m,m2=n;
        for (int[] op : ops) {
            m1=Math.min(m1,op[0]);
            m2=Math.min(m2,op[1]);
        }
        return m1*m2;
    }

    public static void main(String[] args) {
        System.out.println(new Solution598().maxCount(3,3,new int[][]{{2,2},{3,3}}));
    }
}
